Diagram Geometry

نویسنده

  • Antonio Pasini
چکیده

The theory of buildings, created by J. Tits three decads ago, has ooered a uniied geometric treatment of nite simple groups of Lie type, both of classical and of exceptional type. (See Tits 19] and 20] for an exposition of that theory; also Ronan 15] and Brown 1].) Diagram geometry (see 13] for an exposition) is a generalization of the theory of buildings. It has been invented by F. Buekenhout 2] in the late seventies, in order to get a framework suited for sporadic simple groups, too. The concept of diagram is the basic idea of this theory. A diagram is like a blueprint describing a possible combination of 2-dimensional incidence structures in a higher-dimensional geometry. In this context, a geometry of rank n is a connected graph ? equipped with an n-partition such that every maximal clique of ? meets every class of. The vertices and the adjacency relation of ? are the elements and the incidence relation of the geometry G = (?;), the cliques of ? are called ags, the neighborhood of a non-maximal ag is its residue, the classes of are called types and the type (respectively, rank) of a residue is the set (respectively, number) of types met by it. Given a catalogue of`nice' geometries of rank 2 and a symbol for each of those classes, one can compose diagrams of any rank by those symbols. The nodes of a diagram represent types and, by attaching a label to the stroke connecting two types i and j or by some other convention, one indicates which class the residues of type fi; j g should belong to. For instance, a simple stroke a double stroke and thènull stroke' are normally used to denote, respectively, the class of projective planes, the class of generalized quadrangles (see 14]) and the class of generalized digons (generalized digons are the trivial geometries of rank 2, where any two elements of diierent type are incident). The following two diagrams are drawn according to these conventions 1) 2) They represent geometries of rank 3, where the residues of type f1; 2g are projec-tive planes and the residues of type f1; 3g are generalized digons. However, the residues of type f2; 3g are projective planes in 1) and generalized quadrangles in 2). The geometries described by 1) are precisely the (possibly degenerate) 3-dimensional projective geometries, whereas 2) includes all rank 3 polar spaces …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near Pole Polar Diagram of Points and its Duality with Applications

In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...

متن کامل

Conformal Geometry

Arrows in this diagram indicate input from one topic to another. Closely related topics are joined by lines. Conformal geometry is highly analogous to CR geometry, so their boxes are close together and arrows run in both directions. The left hand side of the diagram is largely algebraic. At the top of the diagram, Q-curvature and ambient metrics are specific aspects of conformal geometry, which...

متن کامل

Parallelism in diagram geometry

We introduce the concept of parallelism in diagram geometry, we apply it to a new gluing concept that provides geometries of higher rank, we combine it with another recent extension procedure for geometries and collect many examples solving existence questions for geometries over specified diagrams.

متن کامل

Point Location in Time, Voronoi Diagrams in Time, and Other Transdichotomous Results in Computational Geometry

Given points in the plane with integer coordinates bounded by , we show that the Voronoi diagram can

متن کامل

Diagram Understanding in Geometry Questions

Automatically solving geometry questions is a longstanding AI problem. A geometry question typically includes a textual description accompanied by a diagram. The first step in solving geometry questions is diagram understanding, which consists of identifying visual elements in the diagram, their locations, their geometric properties, and aligning them to corresponding textual descriptions. In t...

متن کامل

Divergence-Based Geometric Clustering and Its Underlying Discrete Proximity Structures

This paper surveys recent progress in the investigation of the underlying discrete proximity structures of geometric clustering with respect to the divergence in information geometry. Geometric clustering with respect to the divergence provides powerful unsupervised learning algorithms, and can be applied to classifying and obtaining generalizations of complex objects represented in the feature...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994